RFID in the warehouse:a literature analysis (1995-2010) of its applications, benefits, challenges and future trends

Radio Frequency Identification (RFID) has been identified as a crucial technology for the modern 21st century knowledge-based economy. Some businesses have realised benefits of RFID adoption through improvements in operational efficiency, additional cost savings, and opportunities for higher revenues. RFID research in warehousing operations has been less prominent than in other application domains. To investigate how RFID technology has had an impact in warehousing, a comprehensive analysis of research findings available from articles through leading scientific article databases has been conducted. Articles from years 1995 to 2010 have been reviewed and analysed with respect to warehouse operations, RFID application domains, benefits achieved and obstacles encountered. Four discussion topics are presented covering RFID in warehousing focusing on its applications, perceived benefits, obstacles to its adoption and future trends. This is aimed at elucidating the current state of RFID in the warehouse and providing insights for researchers to establish new research agendas and for practitioners to consider and assess the adoption of RFID in warehousing functions

Multi-site aggregate production planning with multiple objectives: a goal programming approach

This paper addresses the problem of aggregate production planning (APP) for a multinational lingerie company in Hong Kong. The multi-site production planning problem considers the production loading plans among manufacturing factories subject to certain restrictions, such as production import/export quotas imposed by regulatory requirements of different nations, the use of manufacturing factories/locations with regard to customers' preferences, as well as production capacity, workforce level, storage space and resource conditions of the factories. In this paper, a multi-objective model is developed to solve the production planning problems, in which the profit is maximized but production penalties resulting from going over/under quotas and the change in workforce level are minimized. To enhance the practical implications of the proposed model, different managerial production loading plans are evaluated according to changes in future policy and situation. Numerical results demonstrate the robustness and effectiveness of the developed model

Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm

This paper studies a version of stochastic vehicle routing problems, in which travel and service times are stochastic, and a time window constraint is associated with each customer. This problem is originally formulated as a chance constrained programming model and a stochastic programming model with recourse in terms of different optimization criteria. To efficiently solve these two models, a heuristic based on tabu search, which takes into account the stochastic nature of this problem, is then proposed. Finally, some testing instances with different properties are established to investigate the algorithmic performance, and the computational results are then reported.Vehicle routing problem Stochastic travel time Stochastic service time Time windows Tabu search

A two-stage intelligent search algorithm for the two-dimensional strip packing problem

This paper presents a two-stage intelligent search algorithm for a two-dimensional strip packing problem without guillotine constraint. In the first stage, a heuristic algorithm is proposed, which is based on a simple scoring rule that selects one rectangle from all rectangles to be packed, for a given space. In the second stage, a local search and a simulated annealing algorithm are combined to improve solutions of the problem. In particular, a multi-start strategy is designed to enhance the search capability of the simulated annealing algorithm. Extensive computational experiments on a wide range of benchmark problems from zero-waste to non-zero-waste instances are implemented. Computational results obtained in less than 60 seconds of computation time show that the proposed algorithm outperforms the supposedly excellent algorithms reported recently, on average. It performs particularly better for large instances.Packing problem Heuristic search Simulated annealing

Allocation of empty containers between multi-ports

Owing to imbalances in international trade activities, shipping companies accumulate a large number of unnecessary empty containers in the import-dominant ports, whilst request a large number of empty containers in export-dominant ports. The logistics challenge to shipping companies is to better manage and control their containers, which consist of company-owned containers and leased containers. The multi-port empty container allocation problem is concerned with the allocation of empty containers from supply ports to demand ports. In this paper, optimal pairs of critical policies, (U, D) for one port, which are importing empty containers up to U when the number of empty containers in the port is less than U, or exporting empty containers down to D when the number of empty containers is larger than D, doing nothing otherwise, are adapted to multi-port case so that decision-makers can make decisions about allocating the right amounts of empty containers to the right ports at the right time. This allocation problem has been formulated and the heuristic methods are designed according to that the average cost using (u, d) policy at one port is convex in u and d. Furthermore, the examples show that, using the heuristic algorithm, the result in the inland line case is quite close to the lower bound, even the distance is not so close in the global line case

Revenue-sharing versus wholesale price mechanisms under different channel power structures

We consider a supply chain channel with two manufacturers and one retailer. Each manufacturer can choose either a wholesale price contract or a revenue-sharing contract with the retailer. We discuss and compare the results of two different types of contracts under different channel power structures, to check whether it is beneficial for manufacturers to use revenue-sharing contracts under different scenarios. Then we consider a supply chain channel with one manufacturer and two retailers. Each retailer can choose either a wholesale price contract or a revenue-sharing contract with the manufacturer. We analyze the likely outcomes under different scenarios to discover whether it is beneficial to use revenue-sharing contracts.Game theory Pricing Supply chain management Power structure

Two-period pricing and ordering policy for the dominant retailer in a two-echelon supply chain with demand uncertainty

Retailing channels are increasingly being dominated by 'power' retailers who are in a position to dictate prices and ordering schedules to manufacturers and suppliers. A dominant retailer, such as Wal-Mart, has the 'power' to decide retail prices of products because there are so many manufacturers who are keen to sell their products through or to such a large and powerful retailer. Several products, such as electronic products, can be sold in the market for some periods during their lifecycles before they retreat, except when they are not popular with consumers after been introduced. Therefore, in case of such products, the retailer should not just consider a single-period pricing and ordering policy. It should make dynamic pricing and ordering decisions based on market demand forecast, in order to obtain maximum cumulative profit from the product during its lifecycle. In this study, we consider this scenario and construct a two-period model to discuss pricing and ordering problems for a dominant retailer with demand uncertainty in a declining price environment. We show that the maximum expected profit function is continuous concave, so the optimal solution to pricing and ordering policy exists and it is the one and only. We also analyze sensitivity of retailer's expected profit to the effects of parameters of price-discount sharing scheme and market demand.Dominant retailer Demand uncertainty Optimization